Choices without Backtracking

ثبت نشده
چکیده

ly, one possiblc3 mode of interaction bctwccn the the problLm solver and the dntn base is as follows. A list is maintained of c~cry ;\ssumptioll set disco\rcrcd to bc contradictory. Whcncvcr the problem solver discovers Iwo val~~cs with contt.adictr~ry assumptions, the combined assumption set is placed on this list, and cvcry vaIlIC b,iscd on it or any of its super sets is crascd from the daL\ base. S~upposc cvcry problem-solving step can bc f<)rmt~liltctl Z: from u clad b dctcminc f(n, b) whcrc f takes some problctn solving work. ‘I’hcn the interaction with the data base of values should bc: li)r all \,,~lircs of form cy : and p : add VUIllC unless the assumption set A,, IJ At, a supcrsct of COIIIC known con\radictory set of assumptions. NOK that this schcrr~c dots not have or r-cquirc any notion of context. ‘I&C; cqui~alcnt noLion in the ~~ssumption-based schcn~~ is just a set of :ls5uniptions: implicitly, it SCt Of ilSSlllllptiOl~S SClCCtS illI tllOSC VillUCS uhosc assumplioll set is a SubSCt Of tllC COntCxt’S ilSSul~lptiOn SCt. It is not ncccss;\ry to bc this cxtrcmc. A more sophisticntcd mode of ilitcr‘lction wo\~ld IX to cxplorc only ;I pilIT Of tllC solution SpXC, ix.. only pcrforni infcrcnccs using th0SC ViIlllC$ WllOSC ilSSLllnptil~llS arc iI subset of the current set of intcrcsting nssuniplions. 'I'llCll. WllCll :I contradiction is discovcrcd, the set of intcrcsting assumptions is chnngcd bul nothing is done to the data base. ‘I’hcsc arc just two of many possible modes of intcmction bctwccn the problem solver and the data base. IiCgilrdlCSS of tllC mode 01 inlcractic;n, the basic assumption-based solution addrcsscs the pi OhlClll:~ discuss4 carlicr: The sittglr skr~c problm. ‘I’hc assumptiotl-t~~lscd schcmc allows arbitrariiy many contradictory solutions to coexist. ‘I’hus, it is simple to compare two solutions. Overzealous cotllrarlicliott avoidmcc. ‘I’hc prcscncc of two contr;~tlic~~>ry assertions dncs not tcrminatc work on the ovcmll knowlcdgc stiltc, rather oniy those assertions arc rcmovcd which dcpcnd on the two contr,ldictory assertions. This is exactly the result dcsircd from a contradiction no more, no ICSS. Snilching slilles is cijicull. Changing state is now trivial or irrclcvant. A state is complctcly spccificd by a set of assumptions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Committing to User Choices in Mixed Initiative CSPs

In a mixed initiative system for solving a constraint satisfaction problem (CSP), both the user and the system make choices in trying to nd a solution. These choices typically involve deciding what values to assign to variables. A desirable property in mixed initiative systems is that they commit to user choices: the user assignments should be retained as long as there is a complete solution co...

متن کامل

Theoretical Foundations for Belief Revision

Belief revision systems are AI programs that deal with contradictions. They work with a knowledge base, performing reasoning from the propositions in the knowledge base, "filtering" those propositions so that only part of the knowledge base is perceived the set of propositions that are under consideration. This set of propositions is called the set of believed propositions. Typically, belief re...

متن کامل

Dynamic Backtracking with Constraint Propagation Application to numeric csps

Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local mod...

متن کامل

Specifying Imp(g) Using Asf+sdf: a Case Study

IMP(G) is a language based on distributive categories which allows to deene uniformly classes of computable function arising from a basic set. The syntax of IMP(G) has been deened mathematically in terms of abstract syntax, so that any implementation has to face with a number of choices, ambiguities and polymorphisms of the categorical notation. In this paper we summarize the goals attained usi...

متن کامل

Dynamic Backtracking with Constraint Propagation

Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). In this paper, we show how the ideas developed in that system can be used in order to integrate Constraint Propagation within the Dynamic Backtracking algorithm [Ginsberg, 1993]. Dynamic Backtracking replaces the backtracking proces...

متن کامل

The Asynchronous Backtracking Family

In the last years, the AI community has shown an increasing interest in distributed problem solving. In the scope of distributed constraint reasoning, several asynchronous backtracking procedures have been proposed for finding solutions in a constraint network distributed among several computers. They differ in the way they store failing combinations of values (nogoods), and in the way they che...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999